Analyzing Subclasses of Probabilistic Hybrid Automata

Hybrid automata ooer a framework for the description of systems with both discrete and continuous components, such as digital technology embedded in an analogue environment. Traditional uses of hybrid automata express choice of transitions purely in terms of nondeterminism, abstracting potentially signiicant information concerning the relative likelihood of certain behaviours. To model such probabilistic information, we present a variant of hybrid automata augmented with discrete probability distributions. We concentrate on classes of the model which have restricted continuous dynamics in order to obtain, via appropriate notions of simulation and bisimulation, decidable model checking algorithms for properties expressed in a probabilistic temporal logic.